Clearing directed subgraphs by mobile agents
نویسندگان
چکیده
منابع مشابه
The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents)
We study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset S of vertices of a digraph D and a positive integer k, the objective is to determine whether there is a subgraph H = (VH ,AH) of D such that (a) S ⊆ VH ...
متن کاملClearing Connections by Few Agents
We study the problem of clearing connections by agents placed at some vertices in a directed graph. The agents can move only along directed paths. The objective is to minimize the number of agents guaranteeing that any pair of vertices can be connected by a underlying undirected path that can be cleared by the agents. We provide several results on the hardness, approximability and parameterized...
متن کاملRendezvous of Mobile Agents in Directed Graphs
We study the problem of gathering at the same location two mobile agents that are dispersed in an unknown and unlabeled environment. This problem called Rendezvous, is a fundamental task in distributed coordination among autonomous entities. Most previous studies on the subject model the environment as an undirected graph and the solution techniques rely heavily on the fact that an agent can ba...
متن کاملSecured Directed Diffusion using Mobile Agents
Wireless Sensor Networks comprise of innumerable small sensors that have limited resources. As wireless sensor networks are usually deployed in remote and unfriendly environment to transmit sensitive and crucial information, sensor nodes are vulnerable to node compromise attacks. Security issues such as data confidentiality and integrity which are of utmost importance need proper consideration ...
متن کاملMaintaining a Directed , Triangular Formation of Mobile Autonomous Agents ∗
This paper analyzes a class of distributed control laws which encompasses and generalizes three previously considered types of control laws for maintaining a triangular formation in the plane consisting of three point-modeled, mobile autonomous agents. It is shown that the control laws considered can cause any initially non-collinear, positively-oriented {resp. negatively-oriented} three agent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2019
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2018.11.002